Nuprl Lemma : world-es-val 11,40

the_w:World.
FairFifo
 val-axiom(E;the_w.TA;the_w.M;e.w-info(the_w;e);e.w-pred(the_w;e);
 i,x. s(i;0).x;i.(w-machine(the_w;i).2).1;
 i.w-machine(the_w;i).1;i.w-machine(the_w;i).2.2;e.val(e);e.time(e)) 
latex


Definitionsb, P  Q, x:AB(x), w-info(w;e), t  T, E, x.A(x), kind(e), isrcv(k), islocal(k), x:AB(x), w.M, Msg(M), (x  l), , w.TA, f(a), s = t, x:A  B(x), A c B, x:AB(x), P & Q, val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), FairFifo, World, w-machine-constraint(w), loc(e), False, {x:AB(x)} , IdLnk, Id, A  B, , w.T, vartype(i;x), s(i;t).x, Type, kindcase(ka.f(a); l,t.g(l;t) ), valtype(i;a), val(a), Knd, Void, S  T, outl(x), t.2, t.1, outr(x), , isl(x), , b, if b then t else f fi , Unit, left + right, type List, w-automaton(T;TA;M), <ab>, w-machine(w;i), , tag(k), lnk(k), act(k), suptype(ST), let x,y,z = a in t(x;y;z), time(e), loc(e), a(i;t), isnull(a), A, kind(a), True, {T}, SQType(T), act(e), V(i;k), kind(e), val(e), P  Q, T, P  Q, s ~ t, sender(e), rcv?(e), #$n, x,yt(x;y), xt(x), r + s, n+m, a < b, mlnk(m), source(l), m(i;t), msg(l;t;v), ecase1(e;info;i.f(i);l,e'.g(l;e'))
Lemmasw-rcv-msg, w-time wf, l member wf, squash wf, w-loc wf, msg wf, lnk wf, tagof wf, pi1 wf, pi2 wf, nat wf, not wf, w-isnull wf, unit wf, Msg wf, w-m wf, lsrc wf, mlnk wf, le wf, w-vartype wf, qadd wf, kindcase wf, IdLnk wf, int inc rationals, rcv?-kind, sender wf, false wf, true wf, read-w-state-when, w-eval wf, w-kind-lemma, Id sq, isl wf, w-valtype wf, outl wf, actof wf, w-s wf, w-a wf, w-val wf, w-automaton wf, w-machine wf, ifthenelse wf, bnot wf, w-TA wf, Id wf, w-M wf, rationals wf, w-T wf, loc wf, w-kind wf, Knd wf, subtype rel self, w-loc-lemma, fair-fifo wf, world wf, w-E wf, islocal wf, assert wf, isrcv wf, kind wf, w-info wf

origin